Greedy Selection of Materialized Views

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Greedy Selection of Materialized Views

Greedy based approach for view selection at each step selects a beneficial view that fits within the space available for view materialization. Most of these approaches are focused around the HRU algorithm, which uses a multidimensional lattice framework to determine a good set of views to materialize. The HRU algorithm exhibits high run time complexity as the number of possible views is exponen...

متن کامل

Materialized Views Selection in a Multidimensional Database

A multidimensional database is a data repository that supports the eecient execution of complex business decision queries. Query response can be signiicantly improved by storing an appropriate set of materialized views. These views are selected from the multidimen-sional lattice whose elements represent the solution space of the problem. Several techniques have been proposed in the past to perf...

متن کامل

Adapted Extremal Optimization For Materialized Views Selection

With the development of databases in general and data warehouses in particular, it is now of a great importance to reduce the administration tasks of data warehouses. The materialization of views is one of the most important optimization techniques. The construction of a configuration of views optimizing the data warehouse is an NP-hard problem. On the other hand, the algorithm called extremal ...

متن کامل

Cluster Based Approach for Selection of Materialized Views

A data warehouse (DW) is a database used for reporting and decision support services of an organization. A thousand of queries are fired in every second to actual database or data warehouse and replying each query in quick time with accuracy is a great concern. Queries to DW are critical regarding to their complexity and length. They often access millions of tuples, and involve joins between re...

متن کامل

Automated Selection of Materialized Views and Indexes in SQL Databases

Automatically selecting an appropriate set of materialized views and indexes for SQL databases is a non-trivial task. A judicious choice must be cost-driven and influenced by the workload experienced by the system. Although there has been work in materialized view selection in the context of multidimensional (OLAP) databases, no past work has looked at the problem of building an industry-streng...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer and Communication Technology

سال: 2010

ISSN: 2231-0371,0975-7449

DOI: 10.47893/ijcct.2010.1006